1 link tagged with all of: lean + autoformalisation + mathematical proof + ai verification
Click any tag below to further narrow down your results
Links
This paper argues that verifying AI-generated mathematical proofs through formal languages like Lean doesn't actually validate the original natural language argument, because translating math text faithfully from English to formal logic is computationally harder than solving the Halting problem. The authors demonstrate this with concrete examples, including OpenAI's claimed proof of Navier-Stokes blow-up, showing the formalized version doesn't match what was originally stated.
- Resolving ambiguities in mathematical natural language to enable semantically faithful translation has infinite complexity in the Solvability Complexity Index hierarchy โ harder than any computable problem including the Halting problem.
- A Lean proof can pass mechanical verification while the formalized statement diverges from the original natural language proof, creating a false sense of security.
- OpenAI's announced Navier-Stokes blow-up proof is used as a concrete case where the Lean formalization doesn't correspond to the natural language version.